Minimizing the Number of Late Tasks with Error Constraint
نویسندگان
چکیده
منابع مشابه
Minimizing Tracking Error While Restricting the Number of Assets
Tracking error minimization is commonly used by the traditional passive fund managers as well as alternative portfolio (for example, hedge fund) managers. We propose a graduated non-convexity method to minimize portfolio tracking error with the total number of assets no greater than a specified integer K. The solution of this tracking error minimization problem is the global minimizer of the su...
متن کاملthe effect of pushed output collaborative tasks on the writing skills of efl learners
there is less published research about how teachers in efl contexts respond to students who are relatively less mature and less competent l2 writers. while writing researchers have examined various issues concerning peer and teacher response in writing-oriented classes, little research has centered on the effect of collaborative tasks particularly dictogloss on writing skills. output collaborat...
15 صفحه اولthe effects of error correction methods on pronunciation accuracy
هدف از انجام این تحقیق مشخص کردن موثرترین متد اصلاح خطا بر روی دقت آهنگ و تاکید تلفظ کلمه در زبان انگلیسی بود. این تحقیق با پیاده کردن چهار متد ارائه اصلاح خطا در چهار گروه، سه گروه آزمایشی و یک گروه تحت کنترل، انجام شد که گروه های فوق الذکر شامل دانشجویان سطح بالای متوسط کتاب اول passages بودند. گروه اول شامل 15، دوم 14، سوم 15 و آخرین 16 دانشجو بودند. دوره مربوطه به مدت 10 هفته ادامه یافت و د...
15 صفحه اولMinimizing the number of late jobs in case of stochastic processing times with minimum success probabilities
We consider the single-machine scheduling problem of minimizing the number of late jobs. We omit here one of the standard assumptions in scheduling theory, which is that the processing times are deterministic. Our main message is that in a number of cases the problem with stochastic processing times can be reformulated as a deterministic problem, which is solvable in polynomial time through the...
متن کاملModels for Minimizing the Weighted Number of Late Jobs with Deterministic Machine Availability Constraints
We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1993
ISSN: 0890-5401
DOI: 10.1006/inco.1993.1050